Errors in Improved Polynomial Algorithm For 3 Sat Proposed By Narendra Chaudhari
نویسنده
چکیده
There are errors in the algorithm proposed by Narendra Chaudhari [2] purporting to solve the 3-sat problem in polynomial time. The present paper presents an instance for which the algorithm outputs erroneous results. Introduction: In his paper [1], Narendra Chaudhari describes an algorithm to find a solution for the 3-sat problem in polynomial time. In a second paper [2], he improves on his previous algorithm. The following paper describes two instances of the 3-sat problem on which the improved algorithm fails to give the expected output.
منابع مشابه
Hybrid Cryptosystem Based on 2-SAT & 3-SAT and the Implications of Polynomial Solvability of 3-SAT
In this paper, we elaborate the security threats that exist on hybrid cryptosystem based on satisfiability problem. In such system the encryption is carried out by generating 3-SAT clauses by random insertion of literal in a given 2-SAT clause instance. The solution of 2-SAT clause instance gives the secret key and the placement of literal for conversion to 3-SAT gives the position vector. Two ...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملMaximal Independent Set Based Approach for Graph Coloring Problem
Graph coloring problem is a well-known NP-complete problem and there are many approaches proposed to solve this problem. For a graph coloring algorithm to be efficient, it must color the input graph with minimum colors and must also find the solution in the minimum possible time. Heuristic approaches emphasize on the time complexity while the exact approaches concentrate on the number of colors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1112.2519 شماره
صفحات -
تاریخ انتشار 2011